Randomized Algorithm for Scaling Factors in Fractal Image Compression
نویسندگان
چکیده
Modern fractal compression methods are based on iterative function systems (IFS), which was developed by Barnsley [1] and Jacquin [2]. During compression, the algorithm partitions the image into a set of square blocks (domain blocks). After this a new partition is made into smaller range blocks [2]. The domain blocks are generally double the size of range blocks. For every range block the nearest domain block is identified among all domain blocks after applying a set of transformations on the domain blocks. Smaller sized images are obtained by storing the information about these transformations alone. The transforms store the domain number, scaling constant, offset etc. This method of compression is called the partitioned iteration function system (PIFS). This paper explores the use of variable scaling factors for the transformation from domain to the range blocks. This variable factor has been generated using a pseudo-random number generator. The results show comparable ratios of compression and RMS error with PIFS (Partitioned iterated function systems) based fractal compression.
منابع مشابه
Fractal Image Compression Technique Using Fixed Level of Scaling
Fractal compression is a technique for encoding images compactly. It is built on local self similarities within the images. Image blocks are seen as rescaled and intensity transformed approximate the copies of blocks found elsewhere in the image. In this paper the Fractal image compression technique using fixed level of scaling is proposed in which the time of encoding process is considerably r...
متن کاملA fast encoding method without search for fractal image compression
A fast coding algorithm for images using vector quantization (VQ) and pixelwise fractal approximation is proposed. The low frequency component of an input image is approximated and its residual is used to calculate the scaling factor of fractal transform. The scaling factor is compressed by transform VQ (TVQ). In the proposed method, lo encode a digital image by an iterated function system (IFS...
متن کاملDesigning and Implementation of Efficient Fuzzy Logic Based Fractal Image Compression Technique in DCT Domain Using Quadtree Algorithm
Fractal image compression (FIC) is an image coding Technology based on the local similarity of image structure. It is broadly used in many fields such as image recovery, image denoising, image verification, and encryption. FIC, still, bear the high computational complexity in encoding. Although many schemes are available to speed up encoding, they do not easily satisfy the encoding time or the ...
متن کاملModified Fast Fractal Image Compression Algorithm in spatial domain
In this paper a new fractal image compression algorithm is proposed in which the time of encoding process is considerably reduced. The algorithm exploits a domain pool reduction approach, along with using innovative predefined values for contrast scaling factor, S, instead of searching it across [0,1]. Only the domain blocks with entropy greater than a threshold are considered as domain pool. A...
متن کاملA Fast Fractal Image Compression Algorithm Using Predefined Values for Contrast Scaling
In this paper a new fractal image compression algorithm is proposed in which the time of encoding process is considerably reduced. The algorithm exploits a domain pool reduction approach, along with using innovative predefined values for contrast scaling factor, S, instead of scanning the parameter space [0,1]. Within this approach only domain blocks with entropies greater than a threshold are ...
متن کامل